Rigidity of Linearly Constrained Frameworks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rigidity of Graphs and Frameworks

The first reference to the rigidity of frameworks in the mathematical literature occurs in a problem posed by Euler in 1776. Consider a polyhedron P in 3-space. We view P as a ‘ panel-and-hinge framework’ in which the faces are 2-dimensional panels and the edges are 1-dimensional hinges. The panels are free to move continuously in 3space, subject to the constraints that the shapes of the panels...

متن کامل

Linearly Constrained Problems

The aim of this paper is to study the convergence properties of the gradient projection method and to apply these results to algorithms for linearly constrained problems. The main convergence result is obtained by defining a projected gradient, and proving that the gradient projection method forces the sequence of projected gradients to zero. A consequence of this result is that if the gradient...

متن کامل

Constructive approaches to the rigidity of frameworks

rigidity matroids – and show that although in dimension 2 a 1-extendable abstract rigidity matroid coincides with the generic rigidity matroid, in dimension 3 they can be different. Section 4.4 is devoted to the study of intersecting submodular functions that induce abstract rigidity matroids. We provide a necessary condition for these functions. With an additional assumption on the symmetry, w...

متن کامل

Large-scale linearly constrained optimization

An algorithm for solving large-scale nonlinear' programs with linear constraints is presented. The method combines efficient sparse-matrix techniques as in the revised simplex method with stable quasi-Newton methods for handling the nonlinearities. A general-purpose production code (MINOS) is described, along with computational experience on a wide variety of problems.

متن کامل

Separation Theorem for Linearly Constrained

We solve the linearly constrained linear-quadratic LQ and linear-quadratic-Gaussian LQG optimal control problems. Closed form expressions of the optimal controls are derived, and the Separation Theorem is generalized.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2018

ISSN: 1073-7928,1687-0247

DOI: 10.1093/imrn/rny170